Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
991	Adaptive Algorithms for Problems Involving Black-Box Lipschitz Functions by Ilya Baran B.S., Massachusetts Institute of Technology (2003) Add to Reading List Source URL: www.mit.edu Language: English - Date: 2006-02-03 21:38:13 Computational complexity theory Online algorithms Algorithm Competitive analysis Best worst and average case Asymptotically optimal algorithm Approximation algorithm Theoretical computer science Applied mathematics Analysis of algorithms
992	Planning Optimal Paths for Multiple Robots on Graphs Jingjin Yu Steven M. LaValle Abstract— In this paper, we study the problem of optimal Add to Reading List Source URL: msl.cs.uiuc.edu Language: English - Date: 2014-02-07 08:36:04 NP-complete problems Operations research Network theory Maximum flow problem Network flow Shortest path problem Linear programming Pebble motion problems Optimization problem Mathematics Theoretical computer science Computational complexity theory
993	Space Lower Bounds for Online Pattern Matching Rapha¨el Clifford1 , Markus Jalsenius1 , Ely Porat2 , and Benjamin Sach1 1 2 Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2011-03-12 09:28:52 Analysis of algorithms Coding theory Computational complexity theory Pattern matching Communication Communication complexity Matching Time complexity Hamming distance Theoretical computer science Applied mathematics Mathematics
994	White Paper (version 1.0): Creating a European Institute for Complexity Studies (EURICS) This document discusses the rationale behind the foundation of a new international institute for research, education and training. Add to Reading List Source URL: pespmc1.vub.ac.be Language: English - Date: 2014-05-02 12:27:24 Nature Structure Cybernetics Complexity Complex systems Systems theory Complex adaptive system Computational complexity theory Self-organization Science Systems Complex systems theory
995	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2010-09-02 11:50:35 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
996	Microsoft PowerPoint - present_pact01 [Compatibility Mode] Add to Reading List Source URL: iacoma.cs.uiuc.edu Language: English - Date: 2010-12-26 00:57:34 Automatic parallelization Computational complexity theory Reduction Speedup Redox Computer science Parallel computing Compiler optimizations Computing
997	Asymmetric Squaring Formulae∗ Jaewook Chung†and M. Anwar Hasan [removed] and [removed] Department of Electrical and Computer Engineering, University of Waterloo, Ontario, Canada Add to Reading List Source URL: www.acsel-lab.com Language: English - Date: 2014-05-23 03:20:22 Multiplication Computational complexity theory Computer arithmetic Toom–Cook multiplication Multiplication algorithm Karatsuba algorithm ISO 216 Time complexity Division Mathematics Arithmetic Theoretical computer science
998	On the P versus NP intersected with co-NP question in communication complexity Stasys Jukna Abstract Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2007-08-30 03:42:23 Complexity classes Quantum complexity theory Mathematical optimization Models of computation NP Bounded-error probabilistic polynomial P versus NP problem PP Communication complexity Theoretical computer science Computational complexity theory Applied mathematics
999	Proceedings of the Twenty-Third Australasian Database Conference (ADC 2012), Melbourne, Australia A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2 Add to Reading List Source URL: people.eng.unimelb.edu.au Language: English - Date: 2012-04-27 08:47:18 Complexity classes Operations research NP Facility location Branch and bound Time complexity Theoretical computer science Computational complexity theory Applied mathematics
1000	arXiv:1312.4455v1 [quant-ph] 16 Dec[removed]The Universe as Quantum Computer Seth Lloyd Department of Mechanical Engineering Massachusetts Institute of Technology Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-12-16 20:26:09 Theory of computation Computability theory Alan Turing Turing machine Digital physics Church–Turing thesis Computational complexity theory Computation Halting problem Theoretical computer science Computer science Mathematics